Simulations for Deep Random Secrecy Protocol
نویسنده
چکیده
We present numerical simulations measuring secrecy and efficiency rate of Perfect Secrecy protocol based on Deep Random assumption presented in former article [9]. Those simulations specifically measure the respective error rates of both legitimate partner and eavesdropper experimented during the exchange of a data flow through the protocol. The measurements of the error rates also enable us to estimate a lower bound of the Cryptologic Limit introduced in [9]. We discuss the variation of the protocol’s parameters and their impact on the measured performance.
منابع مشابه
Perfect Secrecy under Deep Random assumption
We present a new idea to design perfectly secure information exchangeprotocol, based on a new form of randomness, called « Deep Randomness »,generated in such a way that probability distribution of the output signal ismade unknowledgeable for an observer. By limiting, thanks to DeepRandomness, the capacity of the opponent observer to perform bayesianinference over public...
متن کاملSecure Wireless Communications via Cooperative Transmitting
Information-theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to exchange a secret key with a new receiver at a random location, in the presence of passive eavesdroppers at unknown locations. Two spatial point processes, ...
متن کاملDeep Random based Key Exchange protocol resisting unlimited MITM
We present a protocol enabling two legitimate partners sharing an initial secret to mutually authenticate and to exchange an encryption session key. The opponent is an active Man In The Middle (MITM) with unlimited calculation and storage capacities. The resistance to unlimitedly powered MITM is obtained through the combined use of Deep Random secrecy, formerly introduced [9] and proved as unco...
متن کاملReal-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active attacks including concurrent protocol runs if it is implemented using provably secure cryptographic primitives. We prove secrecy of the exchanged keys with respect to the accepted cryptographic definition of real-or-rando...
متن کاملOn the Cryptographic Key Secrecy of the Strengthened Yahalom Protocol
Symbolic secrecy of exchanged keys is arguably one of the most important notions of secrecy shown with automated proof tools. It means that an adversary restricted to symbolic operations on terms can never get the entire key into its knowledge set. Cryptographic key secrecy essentially means computational indistinguishability between the real key and a random one, given the view of a much more ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1611.01683 شماره
صفحات -
تاریخ انتشار 2016